Real-Time Verification of Network Properties Using Atomic Predicates
نویسندگان
چکیده
منابع مشابه
Culling predicates for the Verification of Real-Time Models
We present an algorithm that generates invariants for real-time models. The algorithm, further, prunes the model by first detecting, and then removing idle discrete transitions (transitions which can never be traversed). We next demonstrate how the generated invariants can be used to create a finite-state abstraction for the original model. To this end, we enhance the idea of predicate abstract...
متن کاملSafety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملSafe Runtime Verification of Real-Time Properties
Introducing a monitor on a system typically changes the system’s behaviour by slowing the system down and increasing memory consumption. This may possibly result in creating new bugs, or possibly even ‘fixing’ bugs, only to reappear as the monitor is removed. Properties written in a real-time logic, such as duration calculus, can be particularly sensitive to such changes induced through monitor...
متن کاملDelta-net: Real-time Network Verification Using Atoms
Real-time network verification promises to automatically detect violations of network-wide reachability invariants on the data plane. To be useful in practice, these violations need to be detected in the order of milliseconds, without raising false alarms. To date, most real-time data plane checkers address this problem by exploiting at least one of the following two observations: (i) only smal...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2016
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2015.2398197